Convexity preservation of the four-point interpolatory subdivision scheme

نویسندگان

  • Nira Dyn
  • Frans Kuijt
  • David Levin
  • Ruud van Damme
چکیده

In this note we examine the convexity preserving properties of the (linear) fourpoint interpolatory subdivision scheme of Dyn, Gregory and Levin when applied to functional univariate strictly convex data. Conditions on the tension parameter guaranteeing preservation of convexity are derived. These conditions depend on the initial data. The resulting scheme is the four-point scheme with tension parameter bounded from above by a bound smaller than 1/16. Thus the scheme generates C1 limit functions and has approximation order two.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shape Preserving C2 Interpolatory Subdivision Schemes

Stationary interpolatory subdivision schemes which preserve shape properties such as convexity or monotonicity are constructed. The schemes are rational in the data and generate limit functions that are at least C 2. The emphasis is on a class of six-point convexity preserving subdivision schemes that generate C 2 limit functions. In addition, a class of six-point monotonicity preserving scheme...

متن کامل

A Family of Convexity-Preserving Subdivision Schemes

A new five-point binary subdivision scheme with high continuity and convexity preservation is proposed in this paper. It is shown that the limit curves are C (k = 0, 1, . . . , 7) continuous for the certain range of the parameter. The range of the parameter for the property of convexity preservation of the limit curves is also provided. Experimental results demonstrate the efficiency and flexib...

متن کامل

A Controllable Ternary Interpolatory Subdivision Scheme

A non-uniform 3-point ternary interpolatory subdivision scheme with variable subdivision weights is introduced. Its support is computed. The C and C convergence analysis are presented. To elevate its controllability, a modified edition is proposed. For every initial control point on the initial control polygon a shape weight is introduced. These weights can be used to control the shape of the c...

متن کامل

Interproximate curve subdivision

This paper presents a new curve subdivision algorithm called interproximate subdivision for generating curves that interpolate some given vertices and approximate the other vertices. By the interproximate subdivision, only the vertices specified to be interpolated are fixed and the other vertices are updated at each refinement step. The refinement rules are derived to ensure that the eigenvalue...

متن کامل

Nonlinear Stationary Subdivision

In this paper we study a concrete interpolatory subdivision scheme based on rational interpolation and show that it preserves convexity. §

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1999